package Sort;

/**
 * 排序(8)
 * 堆排序
 * 堆积类似完全二叉树
 */
public class HeapSort extends Template {

    public static void sort(int[] array) {

    }

    public static void main(String[] args) {
        int[] a = Template.getIntData(20);
        System.out.println("堆排序前");

        show(a);
        sort(a);

        assert isSorted(a);
        System.out.println("堆排序后");
        show(a);
    }

}
